0.12/0.12	% Problem    : SLH314^1 : TPTP v7.5.0. Released v7.5.0.
0.12/0.14	% Command    : run_E %s %d THM
0.14/0.35	% Computer : n014.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 30
0.14/0.35	% WCLimit    : 30
0.14/0.35	% DateTime   : Tue Aug  9 02:47:46 EDT 2022
0.14/0.35	% CPUTime    : 
0.20/0.48	The problem SPC is TH0_THM_EQU_NAR
0.20/0.48	Running higher-order on 1 cores theorem proving
0.20/0.48	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.48	# Version: 3.0pre003-ho
0.47/0.65	# Preprocessing class: HSLSSMSSSSSNSFA.
0.47/0.65	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.47/0.65	# Starting new_ho_11 with 30s (1) cores
0.47/0.65	# new_ho_11 with pid 26823 completed with status 0
0.47/0.65	# Result found by new_ho_11
0.47/0.65	# Preprocessing class: HSLSSMSSSSSNSFA.
0.47/0.65	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.47/0.65	# Starting new_ho_11 with 30s (1) cores
0.47/0.65	# No SInE strategy applied
0.47/0.65	# Search class: HGHSM-FSLS32-MSFFFSBN
0.47/0.65	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
0.47/0.65	# Starting new_ho_10 with 17s (1) cores
0.47/0.65	# new_ho_10 with pid 26824 completed with status 0
0.47/0.65	# Result found by new_ho_10
0.47/0.65	# Preprocessing class: HSLSSMSSSSSNSFA.
0.47/0.65	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.47/0.65	# Starting new_ho_11 with 30s (1) cores
0.47/0.65	# No SInE strategy applied
0.47/0.65	# Search class: HGHSM-FSLS32-MSFFFSBN
0.47/0.65	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
0.47/0.65	# Starting new_ho_10 with 17s (1) cores
0.47/0.65	# Preprocessing time       : 0.009 s
0.47/0.65	# Presaturation interreduction done
0.47/0.65	
0.47/0.65	# Proof found!
0.47/0.65	# SZS status Theorem
0.47/0.65	# SZS output start CNFRefutation
0.47/0.65	thf(decl_22, type, finite_finite_nat: set_nat > $o).
0.47/0.65	thf(decl_23, type, finite2012248349et_nat: set_set_nat > $o).
0.47/0.65	thf(decl_24, type, minus_minus_nat: nat > nat > nat).
0.47/0.65	thf(decl_25, type, minus_minus_set_nat: set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_26, type, minus_2038000405et_nat: set_set_nat > set_set_nat > set_set_nat).
0.47/0.65	thf(decl_27, type, if_nat: $o > nat > nat > nat).
0.47/0.65	thf(decl_28, type, if_set_nat: $o > set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_29, type, sup_sup_nat: nat > nat > nat).
0.47/0.65	thf(decl_30, type, sup_sup_set_nat: set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_31, type, lattic1132532769ax_nat: set_nat > nat).
0.47/0.65	thf(decl_32, type, lattic1974000059at_nat: (nat > nat) > set_nat > nat).
0.47/0.65	thf(decl_33, type, lattic1610205273in_nat: set_nat > nat).
0.47/0.65	thf(decl_34, type, lattic2098843663et_nat: set_set_nat > set_nat).
0.47/0.65	thf(decl_35, type, bot_bot_nat_o: nat > $o).
0.47/0.65	thf(decl_36, type, bot_bot_o: $o).
0.47/0.65	thf(decl_37, type, bot_bot_nat: nat).
0.47/0.65	thf(decl_38, type, bot_bot_set_nat: set_nat).
0.47/0.65	thf(decl_39, type, bot_bot_set_set_nat: set_set_nat).
0.47/0.65	thf(decl_40, type, ord_less_eq_nat_o: (nat > $o) > (nat > $o) > $o).
0.47/0.65	thf(decl_41, type, ord_less_eq_nat: nat > nat > $o).
0.47/0.65	thf(decl_42, type, ord_less_eq_set_nat: set_nat > set_nat > $o).
0.47/0.65	thf(decl_43, type, ord_le1613022364et_nat: set_set_nat > set_set_nat > $o).
0.47/0.65	thf(decl_44, type, ord_max_nat_o: (nat > $o) > (nat > $o) > nat > $o).
0.47/0.65	thf(decl_45, type, ord_max_nat: nat > nat > nat).
0.47/0.65	thf(decl_46, type, ord_max_set_nat: set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_47, type, collect_nat: (nat > $o) > set_nat).
0.47/0.65	thf(decl_48, type, insert_nat: nat > set_nat > set_nat).
0.47/0.65	thf(decl_49, type, insert_set_nat: set_nat > set_set_nat > set_set_nat).
0.47/0.65	thf(decl_50, type, is_empty_nat: set_nat > $o).
0.47/0.65	thf(decl_51, type, is_singleton_nat: set_nat > $o).
0.47/0.65	thf(decl_52, type, remove_nat: nat > set_nat > set_nat).
0.47/0.65	thf(decl_53, type, the_elem_nat: set_nat > nat).
0.47/0.65	thf(decl_54, type, member_nat: nat > set_nat > $o).
0.47/0.65	thf(decl_55, type, member_set_nat: set_nat > set_set_nat > $o).
0.47/0.65	thf(decl_56, type, f: set_nat).
0.47/0.65	thf(decl_57, type, x: nat).
0.47/0.65	thf(decl_58, type, xa: nat).
0.47/0.65	thf(decl_59, type, esk1_3: set_nat > (set_nat > $o) > (nat > nat) > nat).
0.47/0.65	thf(decl_60, type, esk2_3: set_nat > (set_nat > $o) > (nat > nat) > set_nat).
0.47/0.65	thf(decl_61, type, esk3_1: set_nat > set_nat).
0.47/0.65	thf(decl_62, type, esk4_1: set_nat > nat).
0.47/0.65	thf(decl_63, type, esk5_1: set_nat > set_nat).
0.47/0.65	thf(decl_64, type, esk6_1: set_nat > nat).
0.47/0.65	thf(decl_65, type, esk7_2: set_nat > (set_nat > $o) > nat).
0.47/0.65	thf(decl_66, type, esk8_2: set_nat > (set_nat > $o) > set_nat).
0.47/0.65	thf(decl_67, type, esk9_2: set_nat > (set_nat > $o) > set_nat).
0.47/0.65	thf(decl_68, type, esk10_2: set_nat > (set_nat > $o) > nat).
0.47/0.65	thf(decl_69, type, esk11_2: set_nat > (set_nat > $o) > nat).
0.47/0.65	thf(decl_70, type, esk12_2: set_nat > (set_nat > $o) > nat).
0.47/0.65	thf(decl_71, type, esk13_2: set_nat > (set_nat > $o) > set_nat).
0.47/0.65	thf(decl_72, type, esk14_1: (set_nat > $o) > set_nat).
0.47/0.65	thf(decl_73, type, esk15_1: (set_nat > $o) > nat).
0.47/0.65	thf(decl_74, type, esk16_1: (set_nat > $o) > set_nat).
0.47/0.65	thf(decl_75, type, esk17_1: (nat > $o) > nat).
0.47/0.65	thf(decl_76, type, esk18_1: (nat > $o) > nat).
0.47/0.65	thf(decl_77, type, esk19_1: set_nat > nat).
0.47/0.65	thf(decl_78, type, esk20_3: set_nat > set_nat > (set_nat > $o) > nat).
0.47/0.65	thf(decl_79, type, esk21_3: set_nat > set_nat > (set_nat > $o) > set_nat).
0.47/0.65	thf(decl_80, type, esk22_3: set_nat > set_nat > (set_nat > $o) > nat).
0.47/0.65	thf(decl_81, type, esk23_3: set_nat > set_nat > (set_nat > $o) > set_nat).
0.47/0.65	thf(decl_82, type, esk24_2: (nat > $o) > (nat > $o) > nat).
0.47/0.65	thf(decl_83, type, esk25_1: (nat > nat > $o) > nat).
0.47/0.65	thf(decl_84, type, esk26_1: (nat > nat > $o) > nat).
0.47/0.65	thf(decl_85, type, esk27_1: (nat > nat > $o) > nat).
0.47/0.65	thf(decl_86, type, esk28_1: (nat > nat > $o) > nat).
0.47/0.65	thf(decl_87, type, esk29_4: nat > nat > (nat > set_nat) > set_nat > nat).
0.47/0.65	thf(decl_88, type, esk30_4: nat > nat > (nat > set_nat) > set_nat > nat).
0.47/0.65	thf(decl_89, type, esk31_4: set_nat > set_nat > (set_nat > nat) > nat > set_nat).
0.47/0.65	thf(decl_90, type, esk32_4: set_nat > set_nat > (set_nat > nat) > nat > set_nat).
0.47/0.65	thf(decl_91, type, esk33_4: set_nat > set_nat > (set_nat > set_nat) > set_nat > set_nat).
0.47/0.65	thf(decl_92, type, esk34_4: set_nat > set_nat > (set_nat > set_nat) > set_nat > set_nat).
0.47/0.65	thf(decl_93, type, esk35_4: nat > nat > (nat > nat) > nat > nat).
0.47/0.65	thf(decl_94, type, esk36_4: nat > nat > (nat > nat) > nat > nat).
0.47/0.65	thf(decl_95, type, esk37_4: set_nat > (nat > set_nat) > nat > nat > nat).
0.47/0.65	thf(decl_96, type, esk38_4: set_nat > (nat > set_nat) > nat > nat > nat).
0.47/0.65	thf(decl_97, type, esk39_4: nat > (set_nat > nat) > set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_98, type, esk40_4: nat > (set_nat > nat) > set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_99, type, esk41_4: set_nat > (set_nat > set_nat) > set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_100, type, esk42_4: set_nat > (set_nat > set_nat) > set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_101, type, esk43_4: nat > (nat > nat) > nat > nat > nat).
0.47/0.65	thf(decl_102, type, esk44_4: nat > (nat > nat) > nat > nat > nat).
0.47/0.65	thf(decl_103, type, esk45_4: nat > nat > (nat > set_nat) > set_nat > nat).
0.47/0.65	thf(decl_104, type, esk46_4: nat > nat > (nat > set_nat) > set_nat > nat).
0.47/0.65	thf(decl_105, type, esk47_4: set_nat > set_nat > (set_nat > nat) > nat > set_nat).
0.47/0.65	thf(decl_106, type, esk48_4: set_nat > set_nat > (set_nat > nat) > nat > set_nat).
0.47/0.65	thf(decl_107, type, esk49_4: set_nat > set_nat > (set_nat > set_nat) > set_nat > set_nat).
0.47/0.65	thf(decl_108, type, esk50_4: set_nat > set_nat > (set_nat > set_nat) > set_nat > set_nat).
0.47/0.65	thf(decl_109, type, esk51_4: nat > nat > (nat > nat) > nat > nat).
0.47/0.65	thf(decl_110, type, esk52_4: nat > nat > (nat > nat) > nat > nat).
0.47/0.65	thf(decl_111, type, esk53_4: nat > (set_nat > nat) > set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_112, type, esk54_4: nat > (set_nat > nat) > set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_113, type, esk55_4: set_nat > (nat > set_nat) > nat > nat > nat).
0.47/0.65	thf(decl_114, type, esk56_4: set_nat > (nat > set_nat) > nat > nat > nat).
0.47/0.65	thf(decl_115, type, esk57_4: set_nat > (set_nat > set_nat) > set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_116, type, esk58_4: set_nat > (set_nat > set_nat) > set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_117, type, esk59_4: nat > (nat > nat) > nat > nat > nat).
0.47/0.65	thf(decl_118, type, esk60_4: nat > (nat > nat) > nat > nat > nat).
0.47/0.65	thf(decl_119, type, esk61_1: set_nat > nat).
0.47/0.65	thf(decl_120, type, esk62_1: set_nat > nat).
0.47/0.65	thf(decl_121, type, esk63_2: nat > set_nat > set_nat).
0.47/0.65	thf(decl_122, type, esk64_4: nat > set_nat > nat > set_nat > set_nat).
0.47/0.65	thf(decl_123, type, esk65_2: nat > set_nat > set_nat).
0.47/0.65	thf(decl_124, type, esk66_2: set_set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_125, type, esk67_2: set_nat > nat > nat).
0.47/0.65	thf(decl_126, type, esk68_2: set_set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_127, type, esk69_2: set_nat > nat > nat).
0.47/0.65	thf(decl_128, type, esk70_1: set_set_nat > set_nat).
0.47/0.65	thf(decl_129, type, esk71_1: set_nat > nat).
0.47/0.65	thf(decl_130, type, esk72_1: set_set_nat > set_nat).
0.47/0.65	thf(decl_131, type, esk73_1: set_nat > nat).
0.47/0.65	thf(decl_132, type, esk74_1: set_nat > nat).
0.47/0.65	thf(decl_133, type, esk75_2: set_nat > nat > nat).
0.47/0.65	thf(decl_134, type, esk76_1: set_nat > nat).
0.47/0.65	thf(decl_135, type, esk77_1: set_nat > nat).
0.47/0.65	thf(decl_136, type, esk78_1: set_nat > nat).
0.47/0.65	thf(decl_137, type, esk79_1: set_nat > nat).
0.47/0.65	thf(decl_138, type, esk80_2: set_nat > set_nat > nat).
0.47/0.65	thf(decl_139, type, esk81_2: set_nat > nat > nat).
0.47/0.65	thf(decl_140, type, esk82_2: set_nat > set_nat > nat).
0.47/0.65	thf(decl_141, type, esk83_2: set_nat > set_nat > nat).
0.47/0.65	thf(decl_142, type, esk84_2: (nat > $o) > (nat > $o) > nat).
0.47/0.65	thf(decl_143, type, esk85_2: (nat > $o) > (nat > $o) > nat).
0.47/0.65	thf(decl_144, type, esk86_2: set_nat > nat > nat).
0.47/0.65	thf(decl_145, type, esk87_2: set_nat > set_nat > nat).
0.47/0.65	thf(decl_146, type, esk88_2: set_nat > set_nat > nat).
0.47/0.65	thf(decl_147, type, esk89_1: set_nat > nat).
0.47/0.65	thf(decl_148, type, esk90_1: set_nat > nat).
0.47/0.65	thf(decl_149, type, esk91_2: set_nat > nat > nat).
0.47/0.65	thf(decl_150, type, esk92_2: set_nat > nat > nat).
0.47/0.65	thf(decl_151, type, esk93_2: set_nat > nat > nat).
0.47/0.65	thf(decl_152, type, esk94_2: set_nat > nat > nat).
0.47/0.65	thf(decl_153, type, esk95_2: set_nat > nat > nat).
0.47/0.65	thf(decl_154, type, esk96_2: (nat > $o) > nat > nat).
0.47/0.65	thf(decl_155, type, esk97_1: (nat > $o) > nat).
0.47/0.65	thf(decl_156, type, esk98_1: set_nat > nat).
0.47/0.65	thf(decl_157, type, esk99_2: (set_nat > $o) > set_nat > set_nat).
0.47/0.65	thf(decl_158, type, esk100_2: set_nat > (set_nat > $o) > nat).
0.47/0.65	thf(decl_159, type, esk101_2: set_nat > (set_nat > $o) > set_nat).
0.47/0.65	thf(decl_160, type, esk102_2: set_set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_161, type, esk103_2: set_nat > nat > nat).
0.47/0.65	thf(decl_162, type, esk104_2: set_set_nat > set_nat > set_nat).
0.47/0.65	thf(decl_163, type, esk105_2: set_nat > nat > nat).
0.47/0.65	thf(decl_164, type, esk106_2: (set_nat > $o) > set_nat > set_nat).
0.47/0.65	thf(decl_165, type, esk107_2: set_nat > (set_nat > $o) > set_nat).
0.47/0.65	thf(decl_166, type, esk108_2: (nat > $o) > nat > nat).
0.47/0.65	thf(decl_167, type, esk109_1: (nat > $o) > nat).
0.47/0.65	thf(decl_168, type, esk110_0: nat).
0.47/0.65	thf(decl_169, type, epred1_1: set_nat > nat > $o).
0.47/0.65	thf(fact_151_max__def, axiom, ((ord_max_nat)=(^[X181:nat, X21:nat]:(if_nat @ ((ord_less_eq_nat @ X181 @ X21)) @ X21 @ X181))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_151_max__def)).
0.47/0.65	thf(help_If_2_1_If_001t__Nat__Onat_T, axiom, ![X279:nat, X280:nat]:(((if_nat @ (~($true)) @ X279 @ X280)=(X280))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', help_If_2_1_If_001t__Nat__Onat_T)).
0.47/0.65	thf(conj_6, conjecture, ((member_nat @ (ord_max_nat @ x @ xa) @ (insert_nat @ x @ f))&![X100:nat]:((~((member_nat @ X100 @ (insert_nat @ x @ f)))|(ord_less_eq_nat @ X100 @ (ord_max_nat @ x @ xa))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_6)).
0.47/0.65	thf(fact_27_insert__iff, axiom, ![X8:nat, X6:nat, X9:set_nat]:(((member_nat @ X8 @ (insert_nat @ X6 @ X9))<=>(((X8)=(X6))|(member_nat @ X8 @ X9)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_27_insert__iff)).
0.47/0.65	thf(fact_137_max_Oabsorb__iff2, axiom, ((ord_less_eq_nat)=(^[X174:nat, X21:nat]:(((ord_max_nat @ X174 @ X21)=(X21))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_137_max_Oabsorb__iff2)).
0.47/0.65	thf(fact_109_insertI1, axiom, ![X8:nat, X31:set_nat]:((member_nat @ X8 @ (insert_nat @ X8 @ X31))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_109_insertI1)).
0.47/0.65	thf(conj_4, hypothesis, (member_nat @ xa @ f), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_4)).
0.47/0.65	thf(fact_142_max_Oorder__iff, axiom, ((ord_less_eq_nat)=(^[X21:nat, X179:nat]:(((X179)=(ord_max_nat @ X179 @ X21))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_142_max_Oorder__iff)).
0.47/0.65	thf(conj_5, hypothesis, ![X15:nat]:(((member_nat @ X15 @ f)=>(ord_less_eq_nat @ X15 @ xa))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_5)).
0.47/0.65	thf(fact_51_dual__order_Otrans, axiom, ![X6:nat, X8:nat, X7:nat]:(((ord_less_eq_nat @ X6 @ X8)=>((ord_less_eq_nat @ X7 @ X6)=>(ord_less_eq_nat @ X7 @ X8)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_51_dual__order_Otrans)).
0.47/0.65	thf(fact_73_le__cases, axiom, ![X83:nat, X84:nat]:((~((ord_less_eq_nat @ X83 @ X84))=>(ord_less_eq_nat @ X84 @ X83))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_73_le__cases)).
0.47/0.65	thf(fact_17_order__refl, axiom, ![X26:nat]:((ord_less_eq_nat @ X26 @ X26)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_17_order__refl)).
0.47/0.65	thf(c_0_12, plain, ![X1032:nat, X1033:nat]:(((~(ord_less_eq_nat @ X1032 @ X1033)|((ord_max_nat @ X1032 @ X1033)=(if_nat @ $true @ X1033 @ X1032)))&((ord_less_eq_nat @ X1032 @ X1033)|((ord_max_nat @ X1032 @ X1033)=(if_nat @ $false @ X1033 @ X1032))))), inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_151_max__def])])])).
0.47/0.65	thf(c_0_13, plain, ![X1842:nat, X1843:nat]:(((if_nat @ (~($true)) @ X1842 @ X1843)=(X1843))), inference(variable_rename,[status(thm)],[help_If_2_1_If_001t__Nat__Onat_T])).
0.47/0.65	thf(c_0_14, negated_conjecture, ~(((member_nat @ (ord_max_nat @ x @ xa) @ (insert_nat @ x @ f))&![X100:nat]:((~(member_nat @ X100 @ (insert_nat @ x @ f))|(ord_less_eq_nat @ X100 @ (ord_max_nat @ x @ xa)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_6])])).
0.47/0.65	thf(c_0_15, plain, ![X1468:nat, X1469:nat]:(((~(ord_less_eq_nat @ X1468 @ X1469)|((ord_max_nat @ X1468 @ X1469)=(if_nat @ $true @ X1469 @ X1468)))&((ord_less_eq_nat @ X1468 @ X1469)|((ord_max_nat @ X1468 @ X1469)=(if_nat @ $false @ X1469 @ X1468))))), inference(variable_rename,[status(thm)],[c_0_12])).
0.47/0.65	thf(c_0_16, plain, ![X3:nat, X5:nat]:(((if_nat @ (((($true))!=(($true)))) @ X3 @ X5)=(X5))), inference(split_conjunct,[status(thm)],[c_0_13])).
0.47/0.65	thf(c_0_17, negated_conjecture, (((member_nat @ esk110_0 @ (insert_nat @ x @ f))|~(member_nat @ (ord_max_nat @ x @ xa) @ (insert_nat @ x @ f)))&(~(ord_less_eq_nat @ esk110_0 @ (ord_max_nat @ x @ xa))|~(member_nat @ (ord_max_nat @ x @ xa) @ (insert_nat @ x @ f)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])).
0.47/0.65	thf(c_0_18, plain, ![X1115:nat, X1116:nat, X1117:set_nat]:(((~(member_nat @ X1115 @ (insert_nat @ X1116 @ X1117))|(((X1115)=(X1116))|(member_nat @ X1115 @ X1117)))&((((X1115)!=(X1116))|(member_nat @ X1115 @ (insert_nat @ X1116 @ X1117)))&(~(member_nat @ X1115 @ X1117)|(member_nat @ X1115 @ (insert_nat @ X1116 @ X1117)))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_27_insert__iff])])])).
0.47/0.65	thf(c_0_19, plain, ![X1024:nat, X1025:nat]:(((ord_less_eq_nat @ X1024 @ X1025)<=>((ord_max_nat @ X1024 @ X1025)=(X1025)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_137_max_Oabsorb__iff2])])).
0.47/0.65	thf(c_0_20, plain, ![X5:nat, X3:nat]:(((ord_less_eq_nat @ X3 @ X5)|((ord_max_nat @ X3 @ X5)=(if_nat @ (~($true)) @ X5 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.47/0.65	thf(c_0_21, plain, ![X3:nat, X5:nat]:(((if_nat @ (~($true)) @ X3 @ X5)=(X5))), inference(cn,[status(thm)],[c_0_16])).
0.47/0.65	thf(c_0_22, plain, ![X1376:nat, X1377:set_nat]:((member_nat @ X1376 @ (insert_nat @ X1376 @ X1377))), inference(variable_rename,[status(thm)],[fact_109_insertI1])).
0.47/0.65	thf(c_0_23, negated_conjecture, ((member_nat @ esk110_0 @ (insert_nat @ x @ f))|~((member_nat @ (ord_max_nat @ x @ xa) @ (insert_nat @ x @ f)))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.47/0.65	thf(c_0_24, plain, ![X5:nat, X3:nat, X2:set_nat]:(((member_nat @ X3 @ (insert_nat @ X5 @ X2))|~((member_nat @ X3 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.47/0.65	thf(c_0_25, plain, ![X1435:nat, X1436:nat]:(((~(ord_less_eq_nat @ X1435 @ X1436)|((ord_max_nat @ X1435 @ X1436)=(X1436)))&(((ord_max_nat @ X1435 @ X1436)!=(X1436))|(ord_less_eq_nat @ X1435 @ X1436)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])).
0.47/0.65	thf(c_0_26, plain, ![X3:nat, X5:nat]:((((ord_max_nat @ X3 @ X5)=(X3))|(ord_less_eq_nat @ X3 @ X5))), inference(rw,[status(thm)],[c_0_20, c_0_21])).
0.47/0.65	thf(c_0_27, plain, ![X3:nat, X2:set_nat]:((member_nat @ X3 @ (insert_nat @ X3 @ X2))), inference(split_conjunct,[status(thm)],[c_0_22])).
0.47/0.65	thf(c_0_28, negated_conjecture, ((member_nat @ esk110_0 @ (insert_nat @ x @ f))|~((member_nat @ (ord_max_nat @ x @ xa) @ f))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.47/0.65	thf(c_0_29, plain, ![X3:nat, X5:nat]:((((ord_max_nat @ X3 @ X5)=(X5))|~((ord_less_eq_nat @ X3 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_25])).
0.47/0.65	thf(c_0_30, hypothesis, (member_nat @ xa @ f), inference(split_conjunct,[status(thm)],[conj_4])).
0.47/0.65	thf(c_0_31, negated_conjecture, ((member_nat @ esk110_0 @ (insert_nat @ x @ f))|(ord_less_eq_nat @ x @ xa)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_26]), c_0_27])])).
0.47/0.65	thf(c_0_32, plain, ![X1028:nat, X1029:nat]:(((ord_less_eq_nat @ X1028 @ X1029)<=>((X1029)=(ord_max_nat @ X1029 @ X1028)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_142_max_Oorder__iff])])).
0.47/0.65	thf(c_0_33, hypothesis, ![X1851:nat]:((~(member_nat @ X1851 @ f)|(ord_less_eq_nat @ X1851 @ xa))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_5])])).
0.47/0.65	thf(c_0_34, plain, ![X5:nat, X3:nat, X2:set_nat]:((((X3)=(X5))|(member_nat @ X3 @ X2)|~((member_nat @ X3 @ (insert_nat @ X5 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.47/0.65	thf(c_0_35, negated_conjecture, (member_nat @ esk110_0 @ (insert_nat @ x @ f)), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])]), c_0_31])).
0.47/0.65	thf(c_0_36, plain, ![X1446:nat, X1447:nat]:(((~(ord_less_eq_nat @ X1446 @ X1447)|((X1447)=(ord_max_nat @ X1447 @ X1446)))&(((X1447)!=(ord_max_nat @ X1447 @ X1446))|(ord_less_eq_nat @ X1446 @ X1447)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])).
0.47/0.65	thf(c_0_37, plain, ![X1174:nat, X1175:nat, X1176:nat]:((~(ord_less_eq_nat @ X1174 @ X1175)|(~(ord_less_eq_nat @ X1176 @ X1174)|(ord_less_eq_nat @ X1176 @ X1175)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_51_dual__order_Otrans])])).
0.47/0.65	thf(c_0_38, hypothesis, ![X3:nat]:(((ord_less_eq_nat @ X3 @ xa)|~((member_nat @ X3 @ f)))), inference(split_conjunct,[status(thm)],[c_0_33])).
0.47/0.65	thf(c_0_39, negated_conjecture, (((esk110_0)=(x))|(member_nat @ esk110_0 @ f)), inference(spm,[status(thm)],[c_0_34, c_0_35])).
0.47/0.65	thf(c_0_40, negated_conjecture, (~((ord_less_eq_nat @ esk110_0 @ (ord_max_nat @ x @ xa)))|~((member_nat @ (ord_max_nat @ x @ xa) @ (insert_nat @ x @ f)))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.47/0.65	thf(c_0_41, plain, ![X3:nat, X5:nat]:((((X5)=(ord_max_nat @ X5 @ X3))|~((ord_less_eq_nat @ X3 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_36])).
0.47/0.65	thf(c_0_42, plain, ![X6:nat, X5:nat, X3:nat]:(((ord_less_eq_nat @ X6 @ X5)|~((ord_less_eq_nat @ X3 @ X5))|~((ord_less_eq_nat @ X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_37])).
0.47/0.65	thf(c_0_43, hypothesis, (((esk110_0)=(x))|(ord_less_eq_nat @ esk110_0 @ xa)), inference(spm,[status(thm)],[c_0_38, c_0_39])).
0.47/0.65	thf(c_0_44, plain, ![X83:nat, X84:nat]:((~(ord_less_eq_nat @ X83 @ X84)=>(ord_less_eq_nat @ X84 @ X83))), inference(fof_simplification,[status(thm)],[fact_73_le__cases])).
0.47/0.65	thf(c_0_45, negated_conjecture, (~((member_nat @ xa @ (insert_nat @ x @ f)))|~((ord_less_eq_nat @ esk110_0 @ xa))|~((ord_less_eq_nat @ x @ xa))), inference(spm,[status(thm)],[c_0_40, c_0_29])).
0.47/0.65	thf(c_0_46, negated_conjecture, (~((ord_less_eq_nat @ esk110_0 @ x))|~((ord_less_eq_nat @ xa @ x))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_27])])).
0.47/0.65	thf(c_0_47, hypothesis, ![X3:nat]:((((esk110_0)=(x))|(ord_less_eq_nat @ esk110_0 @ X3)|~((ord_less_eq_nat @ xa @ X3)))), inference(spm,[status(thm)],[c_0_42, c_0_43])).
0.47/0.65	thf(c_0_48, plain, ![X1231:nat, X1232:nat]:(((ord_less_eq_nat @ X1231 @ X1232)|(ord_less_eq_nat @ X1232 @ X1231))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])).
0.47/0.65	thf(c_0_49, negated_conjecture, (~((ord_less_eq_nat @ esk110_0 @ xa))|~((ord_less_eq_nat @ x @ xa))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_24]), c_0_30])])).
0.47/0.65	thf(c_0_50, negated_conjecture, (((esk110_0)=(x))|~((ord_less_eq_nat @ xa @ x))), inference(spm,[status(thm)],[c_0_46, c_0_47])).
0.47/0.65	thf(c_0_51, plain, ![X5:nat, X3:nat]:(((ord_less_eq_nat @ X3 @ X5)|(ord_less_eq_nat @ X5 @ X3))), inference(split_conjunct,[status(thm)],[c_0_48])).
0.47/0.65	thf(c_0_52, negated_conjecture, (((esk110_0)=(x))|~((ord_less_eq_nat @ x @ xa))), inference(spm,[status(thm)],[c_0_49, c_0_43])).
0.47/0.65	thf(c_0_53, plain, ![X1093:nat]:((ord_less_eq_nat @ X1093 @ X1093)), inference(variable_rename,[status(thm)],[fact_17_order__refl])).
0.47/0.65	thf(c_0_54, negated_conjecture, ((ord_less_eq_nat @ x @ xa)|~((ord_less_eq_nat @ esk110_0 @ x))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_26]), c_0_27])])).
0.47/0.65	thf(c_0_55, negated_conjecture, ((esk110_0)=(x)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_51]), c_0_52])).
0.47/0.65	thf(c_0_56, plain, ![X3:nat]:((ord_less_eq_nat @ X3 @ X3)), inference(split_conjunct,[status(thm)],[c_0_53])).
0.47/0.65	thf(c_0_57, negated_conjecture, (ord_less_eq_nat @ x @ xa), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54, c_0_55]), c_0_56])])).
0.47/0.65	thf(c_0_58, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49, c_0_55])]), c_0_57])]), ['proof']).
0.47/0.65	# SZS output end CNFRefutation
0.47/0.65	# Parsed axioms                        : 346
0.47/0.65	# Removed by relevancy pruning/SinE    : 0
0.47/0.65	# Initial clauses                      : 638
0.47/0.65	# Removed in clause preprocessing      : 58
0.47/0.65	# Initial clauses in saturation        : 580
0.47/0.65	# Processed clauses                    : 1127
0.47/0.65	# ...of these trivial                  : 11
0.47/0.65	# ...subsumed                          : 288
0.47/0.65	# ...remaining for further processing  : 827
0.47/0.65	# Other redundant clauses eliminated   : 119
0.47/0.65	# Clauses deleted for lack of memory   : 0
0.47/0.65	# Backward-subsumed                    : 14
0.47/0.65	# Backward-rewritten                   : 24
0.47/0.65	# Generated clauses                    : 2929
0.47/0.65	# ...of the previous two non-redundant : 2329
0.47/0.65	# ...aggressively subsumed             : 0
0.47/0.65	# Contextual simplify-reflections      : 2
0.47/0.65	# Paramodulations                      : 2789
0.47/0.65	# Factorizations                       : 2
0.47/0.65	# NegExts                              : 0
0.47/0.65	# Equation resolutions                 : 125
0.47/0.65	# Propositional unsat checks           : 0
0.47/0.65	#    Propositional check models        : 0
0.47/0.65	#    Propositional check unsatisfiable : 0
0.47/0.65	#    Propositional clauses             : 0
0.47/0.65	#    Propositional clauses after purity: 0
0.47/0.65	#    Propositional unsat core size     : 0
0.47/0.65	#    Propositional preprocessing time  : 0.000
0.47/0.65	#    Propositional encoding time       : 0.000
0.47/0.65	#    Propositional solver time         : 0.000
0.47/0.65	#    Success case prop preproc time    : 0.000
0.47/0.65	#    Success case prop encoding time   : 0.000
0.47/0.65	#    Success case prop solver time     : 0.000
0.47/0.65	# Current number of processed clauses  : 350
0.47/0.65	#    Positive orientable unit clauses  : 76
0.47/0.65	#    Positive unorientable unit clauses: 4
0.47/0.65	#    Negative unit clauses             : 12
0.47/0.65	#    Non-unit-clauses                  : 258
0.47/0.65	# Current number of unprocessed clauses: 2137
0.47/0.65	# ...number of literals in the above   : 7014
0.47/0.65	# Current number of archived formulas  : 0
0.47/0.65	# Current number of archived clauses   : 410
0.47/0.65	# Clause-clause subsumption calls (NU) : 25974
0.47/0.65	# Rec. Clause-clause subsumption calls : 11230
0.47/0.65	# Non-unit clause-clause subsumptions  : 230
0.47/0.65	# Unit Clause-clause subsumption calls : 1168
0.47/0.65	# Rewrite failures with RHS unbound    : 0
0.47/0.65	# BW rewrite match attempts            : 87
0.47/0.65	# BW rewrite match successes           : 55
0.47/0.65	# Condensation attempts                : 1128
0.47/0.65	# Condensation successes               : 16
0.47/0.65	# Termbank termtop insertions          : 85219
0.47/0.65	
0.47/0.65	# -------------------------------------------------
0.47/0.65	# User time                : 0.150 s
0.47/0.65	# System time              : 0.011 s
0.47/0.65	# Total time               : 0.161 s
0.47/0.65	# Maximum resident set size: 4364 pages
0.47/0.65	
0.47/0.65	# -------------------------------------------------
0.47/0.65	# User time                : 0.161 s
0.47/0.65	# System time              : 0.013 s
0.47/0.65	# Total time               : 0.174 s
0.47/0.65	# Maximum resident set size: 2220 pages
0.47/0.65	EOF